On the resolutions of cyclic Steiner triple systems with small parameters ∗
نویسنده
چکیده
The paper presents useful invariants of resolutions of cyclic STS(v) with v ≤ 39, namely of all resolutions of cyclic STS(15), STS(21) and STS(27), of the resolutions with nontrivial automorphisms of cyclic STS(33) and of resolutions with automorphisms of order 13 of cyclic STS(39). 2010 MSC: 05B07, 05E18
منابع مشابه
Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs
We give a characterization of a current assignment on the bipartite Möbius ladder graph with 2n + 1 rungs. Such an assignment yields an index one current graph with current group Z12n+7 that generates an orientable face 2-colorable triangular embedding of the complete graph K12n+7 or, equivalently, an orientable biembedding of two cyclic Steiner triple systems of order 12n+7. We use our charact...
متن کاملThe chromatic index of block intersection graphs of Kirkman triple systems and cyclic Steiner triple systems
The block intersection graph of a combinatorial design with block set B is the graph with B as its vertex set such that two vertices are adjacent if and only if their associated blocks are not disjoint. The chromatic index of a graph G is the least number of colours that enable each edge of G to be assigned a single colour such that adjacent edges never have the same colour. A graph G for which...
متن کاملCirculants and the Chromatic Index of Steiner Triple Systems
We complete the determination of the chromatic number of 6valent circulants of the form C(n; a, b, a+b) and show how this can be applied to improving the upper bound on the chromatic index of cyclic Steiner triple systems.
متن کاملSelf-embeddings of Hamming Steiner triple systems of small order and APN permutations
The classification, up to isomorphism, of all self-embedding monomial power permutations of Hamming Steiner triple systems of order n = 2m − 1 for small m, m ≤ 22, is given. As far as we know, for m ∈ {5, 7, 11, 13, 17, 19}, all given self-embeddings in closed surfaces are new. Moreover, they are cyclic for all m and nonorientable at least for all m ≤ 19. For any non prime m, the nonexistence o...
متن کاملOptimal (v, 3, 1) binary cyclically permutable constant weight codes with small v
We classify up to multiplier equivalence optimal (v, 3, 1) binary cyclically permutable constant weight (CPCW) codes with v ≤ 61. There is a one-to-one correspondence between optimal (v, 3, 1) CPCW codes, optimal cyclic binary constant weight codes with weight 3 and minimal distance 4, (v, 3; b(v − 1)/6c) difference packings, and optimal (v, 3, 1) optical orthogonal codes. Therefore the classif...
متن کامل